An improved upper bound for the order of mixed graphs
نویسندگان
چکیده
منابع مشابه
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln lnm) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best ...
متن کاملan improved mixed order model for describing thermoluminescence glow curves
an improved mixed order model is presented to describe the thermolumunescence (tl) glow peaks. in this model a fraction of charge carriers, which undergo nonradiative recombination following thermal excitation is taken into account. therefore, it is expected that the proposed model will produce more realistic kinetic parameters than that of mixed order model. the tl glow curves generated by the...
متن کاملAn upper bound to the second Hankel functional for the class of gamma-starlike functions
The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$ for the function $f$, belonging to the class of Gamma-starlike functions, using Toeplitz determinants. The result presented here include two known results as their special cases.
متن کاملAn improved upper bound for the Laplacian spectral radius of graphs
In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t Let G be a simple graph with n vertices, m edges. Let ∆ and δ be the maximum and minimum degree of G, respec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.06.016